A New Privacy Homomorphism and Applications
نویسنده
چکیده
An additive and multiplicative privacy homomorphism is an encryption function mapping addition and multiplication of cleartext data into two operations on encrypted data. One such privacy homomorphism is introduced which has the novel property of seeming secure against a known-cleartext attack. An application to multilevel statistical computation is presented, namely classiied retrieval of exact statistics from unclassiied computation on disclosure-protected (perturbed) data.
منابع مشابه
Implementation of Homomorphic Encryption Schemes for Secure Packet Forwarding in Mobile Ad Hoc Networks (MANETs)
In this paper we provide a new scheme to securely forward the message in wireless mobile ad hoc networks (MANETs) by using existing homomorphic encryption schemes. This scheme is an alternative for threshold cryptography (TC) in MANETs to securely forward the message. By using homomorphic encryption schemes we remove the computational cost associated with Lagrange Interpolation scheme used in T...
متن کاملA new privacy homomorphism and applications
An additive and multiplicative privacy homomorphism is an encryption function mapping addition and multiplication of cleartext data into two operations on encrypted data. One such privacy homomorphism is introduced which has the novel property of seeming secure against a known-cleartext attack. An application to multilevel statistical computation is presented, namely classified retrieval of exa...
متن کاملFinding Minimum Optimal Path Securely Using Homomorphic Encryption Schemes in Computer Networks
In this paper we find a secure routing protocol for computer networks, which finds minimum optimum path using homomorphic encryption schemes. We briefly look into the existing homomorphic encryption algorithms. We make use of ElGamal encryption, Elliptic Curve encryption and a privacy homomorphism, which exhibits the property of homomorphism in our new routing protocol. Elliptic curve exhibits ...
متن کاملno-homomorphism conditions for hypergraphs
In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.
متن کاملTraceability improvements of a new RFID protocol based on EPC C1 G2
Radio Frequency Identification (RFID) applications have spread all over the world. In order to provide their security and privacy, researchers proposed different kinds of protocols. In this paper, we analyze the privacy of a new protocol, proposed by Yu-Jehn in 2015 which is based on Electronic Product Code Class1 Generation 2 (EPC C1 G2) standard. By applying the Ouafi_Phan privacy model, we s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 60 شماره
صفحات -
تاریخ انتشار 1996